The unsolvable identity problem
نویسنده
چکیده
The identity problem is intractable. To shed light on the problem, which currently is a swirl of interlocking problems that tend to get tumbled together in any discussion, we separate out the various issues so they can be rationally addressed one at a time as much as possible. We explore various aspects of the problem, pick one aspect to focus on, pose an idealized theoretical solution, and then explore the factors rendering this solution impractical. The success of this endeavor depends on our agreement that the selected aspect is a good one to focus on, and that the idealized solution represents a desirable target to try to approximate as well as we can. If we achieve consensus here, then we at least have a unifying framework for coordinating the various partial solutions to fragments of the problem. The unsolvable identity problem
منابع مشابه
Gathering Autonomous Mobile Robots in Non Totally Symmetric Conngurations
We study the problem of coordinating a set of autonomous mobile robots that can freely move in a two-dimensional plane; in particular, we want them to gather at a point not xed in advance (Gathering Problem). We introduce a model of weak robots (decentralized, asynchronous, no common knowledge, no identities, no central coordination, no direct communication, oblivious) which can observe the set...
متن کاملGroups With Two Generators Having Unsolvable Word Problem And Presentations of Mihailova Subgroups
A presentation of a group with two generators having unsolvable word problem and an explicit countable presentation of Mihailova subgroup of F2 × F2 with finite number of generators are given. Where Mihailova subgroup of F2 × F2 enjoys the unsolvable subgroup membership problem. One then can use the presentation to create entities’ private keys in a public key cryptsystem.
متن کاملThe Conjugacy and Isomorphism Problems for Combable Groups
There exist combable groups in which the conjugacy problem is unsolvable. The isomorphism problem is unsolvable for certain recursive sequences of finite presentations of combable groups.
متن کاملUndecidability and the Developability of Permutoids and Rigid Pseudogroups
A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that determines whether or not a permutoid based on a finite set can be completed to a finite permutation group. In this note we prove Cameron’s conjecture by relati...
متن کاملTuring machines to word problems
We trace the emergence of unsolvable problems in algebra and topology from the unsolvable halting problem for Turing machines. §
متن کامل